Digital Logic
Q31.
Let # be a binary operator defined as X#Y=X'+Y' where X and Y are Boolean variables. Consider the following two statements. (S1) (P # Q) # R = P # (Q # R) (S2) Q # R = R # Q Which of the following is/are true for the Boolean variables P, Q and R?Q32.
The total number of prime implicants of the function f(w,x,y,z)=\Sigma(0,2,4,5,6,10) is _______.Q36.
Consider the following minterm expression for F. F(P,Q,R,S) = \Sigma 0, 2, 5, 7, 8, 10, 13, 15 The minterms 2, 7, 8 and 13 are 'do not care terms. The minimal sum of-products form for F isQ37.
Consider the following Boolean Algebra for F: F(P,Q,R,S)=PQ+\bar{P}QR+\bar{P}Q\bar{R}S The minimal sum-of products form of F isQ39.
The most simplified form of the Boolean function x (A, B, C, D) = \sum (7, 8, 9, 10, 11, 12, 13, 14, 15) (expressed in sum of minterms) is?Q40.
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ?